m-Potential Theory and m-Generalized Lelong Numbers Associated with m-Positive Supercurrents
نویسندگان
چکیده
In this study, we first define the local potential associated to a weakly positive closed supercurrent in analogy one investigated by Ben Messaoud and El Mir complex setting. Next, study definition continuity of m-superHessian operator for unbounded m-convex functions. As an application, generalize our previous work on Demailly-Lelong numbers several related results superformalism Furthermore, strongly inspired Hessian theory, introduce Cegrell-type classes as well generalization some m-potential class
منابع مشابه
M m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملEternal m-security subdivision numbers in graphs
An eternal $m$-secure set of a graph $G = (V,E)$ is aset $S_0subseteq V$ that can defend against any sequence ofsingle-vertex attacks by means of multiple-guard shifts along theedges of $G$. A suitable placement of the guards is called aneternal $m$-secure set. The eternal $m$-security number$sigma_m(G)$ is the minimum cardinality among all eternal$m$-secure sets in $G$. An edge $uvin E(G)$ is ...
متن کاملEternal m- Security Subdivision Numbers in Graphs
Let be a simple graph with vertex set and edges set . A set is a dominating set if every vertex in is adjacent to at least one vertex in . An eternal 1-secure set of a graph G is defined as a dominating set such that for any positive integer k and any sequence of vertices, there exists a sequence of guards with and either or and is a dominating set. If we take a guard on every ver...
متن کاملUnderstanding Hydrogen Adsorption in MIL-47-M (M = V and Fe) through Density Functional Theory
The present paper aims to investigate the role of open metal site metal-organic frameworks (MOFs) on hydrogen adsorptivity using periodic boundary condition (PBC) density functional theory (DFT). Hence, MIL-47-M (M = V and Fe) were selected and one hydrogen molecule adsorptivity was calculated in different orientations on them. Four different chemical sites were identified in every cluster sect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Analysis and Operator Theory
سال: 2022
ISSN: ['1661-8254', '1661-8262']
DOI: https://doi.org/10.1007/s11785-022-01318-4